Proeftuinen zonder wij

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatio-Temporal Chaos and solitons Exhibited by von kÁrmÁn Model

Forced oscillations of flexible plates with a longitudinal, time dependent load acting on one plate side are investigated. Regular (harmonic, subharmonic and quasi-periodic) and irregular (chaotic) oscillations appear depending on the system parameters as well as initial and boundary conditions. In order to achieve highly reliable results, an effective algorithm has been applied to convert a pr...

متن کامل

A probabilistic result for the max-cut problem on random graphs

We consider the max-cut problem on a random graph G with n vertices and weights wij being independent bounded random variables with the same xed positive expectation and variance . It is well known that the max-cut number mc(G) always exceeds 2 ∑ i¡j wij . We prove that with probability greater than pn the max-cut number satis es

متن کامل

Effective-Medium Approximation for Energy-Dependent Hopping on a Lattice

We have generalised the standard lattice Coherent-Potential-Approximation (CPA)/EffectiveMedium-Approximation (EMA) scheme to include the case of energy dependent hopping. This case is complicated by the fact that, due to the detailed-balance condition, the hopping rates wij are non-symmetric, i. e. wij 6ˆ wji. Results for the frequency dependent diffusion coefficient are compared with Monte-Ca...

متن کامل

Filling boxes densely and disjointly

We effectively construct in the Hilbert cube H = [0, 1]ω two sets V, W ⊂ H with the following properties: (a) V ∩ W = ∅, (b) V ∪ W is discrete-dense, i.e. dense in [0, 1]D ω , where [0, 1]D denotes the unit interval equipped with the discrete topology, (c) V , W are open in H. In fact, V = S N Vi, W = S N Wi, where Vi = S2i−1−1 0 Vij , Wi = S2i−1−1 0 Wij . Vij , Wij are basic open sets and (0, ...

متن کامل

Randomized Algorithms 2017A – Lecture 11 Graph Laplacians and Spectral Sparsification∗

Alternative definition: Then LG is the matrix with diagonal entries (LG)ii = di, and off-diagonal entries (LG)ij = −wij . Fact 1: The matrix L = LG is symmetric, non-diagonals entries are Lij = −wij , and its diagonal entries are Lii = di, where di = ∑ j:ij∈E wij is the degree of vertex i. It is useful to put these values in a diagonal matrixD = diag(d⃗). If G is unweighted, then L = D−A where A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bestuurskunde

سال: 2020

ISSN: 0927-3387

DOI: 10.5553/bk/092733872020029003007